# Python 2.6.4
# Project Euler, Problem 179
# Copyright 2010 Talha Zaman

def divisors(lim):  
    divs = [0]*lim
    for i in xrange(2, lim):
        for j in xrange(i, lim, i):
            divs[j] += 1
    return divs

d = divisors(int(1e7))
print sum(1 for j in range(2,len(d)-1) if d[j]==d[j+1])
